An Optimal Key Management Scheme for Group Key Sharing with Polynomial Expression
نویسندگان
چکیده
منابع مشابه
An IBE-based Signcryption Scheme for Group Key Management
This paper presents a new crypto scheme whose title promises it to be so boring that no-one will bother reading past the abstract. Because of this, the remainder of the paper is left blank.
متن کاملAn Improved Overlap-Key-Sharing Key Management Scheme for Wireless Sensor Networks
Key management is the base of wireless sensor network security, key pre-distribution way is a high feasibility method in key management. The network connectivity rate, resilience against node capture and the storage consumption are important performance indicators in key pre-distribution way. However, most of the existing key pre-distribution schemes of wireless sensor network have the problems...
متن کاملA Decentralized Multi-Group Key Management Scheme
Scalability is one of the most important requirements for secure multicast in a multi-group environment. In this study, we propose a decentralized multi-group key management scheme that allows each multicast group sender to control the access to its group communication independently. Scalability is enhanced by local rekeying and inter-working among different subgroups. The group key secrecy and...
متن کاملAn Online Threshold Key Distribution Scheme for Symmetric Key Management
The threshold secret sharing technique has been used extensively in cryptography. This technique is used for splitting secrets into shares and distributing the shares in the network to provide protection against attacks and to reduce the possibility of loss of information. In this paper, a new approach is introduced to enhance communication security among the nodes in a network based on the thr...
متن کاملOptimal Tree Structures for Group Key Management with Batch Updates
We investigate the key management problem for broadcasting applications. Previous work showed that batch rekeying can be more cost-effective than individual rekeying. Under the assumption that every user has probability p of being replaced by a new user during a batch rekeying period, we study the structure of the optimal key trees. Constant bounds on both the branching degree and the subtree s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research Journal of Information Technology
سال: 2013
ISSN: 1815-7432
DOI: 10.3923/rjit.2013.12.23